On approximation and energy estimates for delta 6-convex functions
نویسندگان
چکیده
The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted [Formula: see text]-norm.
منابع مشابه
The Norm Estimates of Pre-Schwarzian Derivatives of Spirallike Functions and Uniformly Convex $alpha$-spirallike Functions
For a constant $alphain left(-frac{pi}{2},frac{pi}{2}right)$, we definea subclass of the spirallike functions, $SP_{p}(alpha)$, the setof all functions $fin mathcal{A}$[releft{e^{-ialpha}frac{zf'(z)}{f(z)}right}geqleft|frac{zf'(z)}{f(z)}-1right|.]In the present paper, we shall give the estimate of the norm of the pre-Schwarzian derivative $mathrm{T}...
متن کاملSome properties and results for certain subclasses of starlike and convex functions
In the present paper, we introduce and investigate some properties of two subclasses $ Lambda_{n}( lambda , beta ) $ and $ Lambda_{n}^{+}( lambda , beta ) $; meromorphic and starlike functions of order $ beta $. In particular, several inclusion relations, coefficient estimates, distortion theorems and covering theorems are proven here for each of these function classes.
متن کاملApproximation of endpoints for multi-valued mappings in metric spaces
In this paper, under some appropriate conditions, we prove some $Delta$ and strong convergence theorems of endpoints for multi-valued nonexpansive mappings using modified Agarwal-O'Regan-Sahu iterative process in the general setting of 2-uniformly convex hyperbolic spaces. Our results extend and unify some recent results of the current literature.
متن کاملInitial coefficients of starlike functions with real coefficients
The sharp bounds for the third and fourth coefficients of Ma-Minda starlike functions having fixed second coefficient are determined. These results are proved by using certain constraint coefficient problem for functions with positive real part whose coefficients are real and the first coefficient is kept fixed. Analogous results are obtained for a general class of close-to-convex functions
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 2018 شماره
صفحات -
تاریخ انتشار 2018